The linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length 2p
نویسندگان
چکیده
In this article, we generalize results about binary sequences of length 2p and evaluate the linear complexity and autocorrelation properties of generalized cyclotomic binary sequences of length 2p. We show that in most cases these sequences have high linear complexity and poor autocorrelation performance.
منابع مشابه
The evaluation of the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length 2p
In this article, we discuss a computation method for the linear complexity of generalized cyclotomic binary sequences of length 2p. This method allows to assess the linear complexity of above-mentioned sequences and to design the sequences with high linear complexity. Also we generalize known results about binary sequences of length 2p. In conclusion we evaluate the autocorrelation of generaliz...
متن کاملLinear complexity of quaternary sequences of length pq with low autocorrelation
The linear complexity L, of a sequence is an important parameter in its evaluation as a key stream cipher for cryptographic applications. Ideally, good sequences combine the autocorrelation properties of a random sequence with high linear complexity. Cyclotomic and generalized cyclotomic sequences are important pseudorandom sequences in stream ciphers due to their good pseudorandom cryptographi...
متن کاملRemarks on a cyclotomic sequence
We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al. (IEEE Trans Inforem Theory 51: 1849–1853, 2005). First we determine the linear complexity of a natural generalization of this binary sequence to arbitrary prime fields. Secondly we consider k-error linear complexity and autocorrelation of these sequences and point out certain drawbacks of this c...
متن کاملAutocorrelation of New Generalized Cyclotomic Sequences of Period pn
Let n ≥ 2 be a positive integer and Z× n be the multiplicative group of the integer ring Zn. For a partition {Di|i = 0, 1, · · · , d − 1} of Z× n , if there exist elements g1, · · · , gd of Z× n satisfying Di = giD0 for all i where D0 is a multiplicative subgroup of Z× n , the Di are called generalized cyclotomic classes of order d. There have been lots of studies about cyclotomy with respect t...
متن کاملTrace Representations and Multi-rate Constructions of Two Classes of Generalized Cyclotomic Sequences
In this paper, two classes of generalized cyclotomic sequences of period pq are reconstructed by means of multi-rate parallel combinations of binary Legendre sequences which are clocked at different rates. Then these generalized cyclotomic sequences can be generated by combinations of short and cheap LFSR’s. From the multi-rate constructions and the trace representation of binary Legendre seque...
متن کامل